Discrete-Time Priority Queues with Partial Interference

June 1984 LIDS - P - 1387 DISCRETE - TIME PRIORITY QUEUES WITH PARTIAL INTERFERENCE

A class of discrete time priority queueing systems with partial interference is considered. Packet-radio communication networks that use a certain mode of operation fall into this class. In these systems N nodes share a common channel to transmit their packets. One node uses random access scheme while the other nodes use the channel according to prescribed priorities. Packet arrivals are modele...

Two Competing Discrete-Time Queues with Priority

Discrete-time Priority Queues with Two-state Markov Modulated Arrivals

A class of discrete-time priority queueing systems with Markov modulated arrivals is considered. In these systems, N queues are served by a single server according to priorities that are preassigned to the queues. Packet arrivals are modeled as discrete-time batch processes with a distribution that depends on the state of an independent common two-state Markov chain. This allows to cover a wide...

Sensitivity Analysis for Discrete-Time Randomized Service Priority Queues∗

We consider a collection of queues operating in parallel and sharing a common server via a “randomized” service priority sharing rule. We assume that the service times of the customers (cells) are all constant and identical. This paper is concerned with estimating the sensitivity of the tail of the distribution of the typical sojourn time through these queues to the fraction of server bandwidth...

Time Dependent Priority Queues

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...